Tractable inference in credal sentential decision diagrams
نویسندگان
چکیده
منابع مشابه
Probabilistic Sentential Decision Diagrams
We propose the Probabilistic Sentential Decision Diagram (PSDD): A complete and canonical representation of probability distributions defined over the models of a given propositional theory. Each parameter of a PSDD can be viewed as the (conditional) probability of making a decision in a corresponding Sentential Decision Diagram (SDD). The SDD itself is a recently proposed complete and canonica...
متن کاملDynamic Minimization of Sentential Decision Diagrams
The Sentential Decision Diagram (SDD) is a recently proposed representation of Boolean functions, containing Ordered Binary Decision Diagrams (OBDDs) as a distinguished subclass. While OBDDs are characterized by total variable orders, SDDs are characterized more generally by vtrees. As both OBDDs and SDDs have canonical representations, searching for OBDDs and SDDs of minimal size simplifies to...
متن کاملEGL2U: Tractable Inference on Large Scale Credal Networks
Credal networks [1, 2] generalize Bayesian networks [3] by associating with variables (closed convex) sets of conditional probability mass functions, i.e., credal sets1, in place of precise conditional probability distributions. Credal networks are models of imprecise probabilities [4], which allow the capturing of incompleteness and imprecision of human knowledge and beliefs [1]. Credal networ...
متن کاملA Top-Down Compiler for Sentential Decision Diagrams
The sentential decision diagram (SDD) has been recently proposed as a new tractable representation of Boolean functions that generalizes the influential ordered binary decision diagram (OBDD). Empirically, compiling CNFs into SDDs has yielded significant improvements in both time and space over compiling them into OBDDs, using a bottomup compilation approach. In this work, we present a top-down...
متن کاملOn the Relative Succinctness of Sentential Decision Diagrams
Sentential decision diagrams (SDDs) introduced by Darwiche in 2011 are a promising representation type used in knowledge compilation. The relative succinctness of representation types is an important subject in this area. The aim of the paper is to identify which kind of Boolean functions can be represented by SDDs of small size with respect to the number of variables the functions are defined ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2020
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2020.06.005